A GENERAL FORMULATION OF CONSTRAINED ITERATIVE RESTORATION ALGORIThMS
نویسندگان
چکیده
This paper introduces a general formulation of constrained iterative restoration algorithms in which deterministic and/or statistical information about the undistorted signal and statistical information about the noise are directly incorporated into the iterative procedure. This a priori information is incorporated into the restoration algorithm by what we call "soft" or statistical constraints. Their effect on the solution depends on the amount of noise on the data; that is, the constraint operator is "turned off" for noiseless data. The development of the new iterative algorithm is based on results from regularization techniques for stabilizing ill-posed problems.
منابع مشابه
Iterative image restoration algorithms
5. 6. I. 8. 9. IO. Introduction Review of deterministic iterative restoration algorithms 2.1. Basic iterative algorithm 2.1.1. Derivation 2.1.2. Convergence 2.2. Basic iterative algorithm with reblurring 2.2.1. Derivation 2.2.2. Convergence and rate of convergence 2.3. Basic iterative algorithm with constraints 2.3. I. Derivation and convergence 2.3.2. Experiment I 2.4. Method of projecting ont...
متن کاملAdaptive Regularized Restoration Algorithms Applied to HST Images
This paper analyzes the performance of two set theoretic-based iterative image restoration algorithms for Hubble Space Telescope (HST) degraded images. The iterative adaptive constrained least squares and frequency adaptive constrained least squares algorithms are optimized here for HST data, and applied to several simulated and real degraded HST images. Evaluations of both the flux linearity a...
متن کاملIonary Iterative Image Restorplt Ion
This paper introduces different types of nonstationary constrained iterative image restoration algorithms, The adaptivity of the algorithm is introduced by the constraint operator which incorporates properties of the response of the human visual system. The properties of the visual system are represented by noise masking and visibility functions. A new way of computing the' masking function is ...
متن کاملERRORLESS RESTORATION ALGORITHMS FOR BAND - LIMITED IMAGESPaulo
We consider the problem of restoring randomly distributed sets of missing pixels in band-limited discrete images , and give non-iterative and iterative algorithms capable of error-free restoration. The methods discussed have minimum dimension, that is, the size of the matrices and vectors which appear in the algorithm is determined by the number of unknown pixels. This is a characteristic which...
متن کاملRepeated Record Ordering for Constrained Size Clustering
One of the main techniques used in data mining is data clustering, which has many applications in computer science, biology, and social sciences. Constrained clustering is a type of clustering in which side information provided by the user is incorporated into current clustering algorithms. One of the well researched constrained clustering algorithms is called microaggregation. In a microaggreg...
متن کامل